Zero-Automatic Queues
نویسندگان
چکیده
We introduce and study a new model: 0-automatic queues. Roughly, 0-automatic queues are characterized by a special buffering mechanism evolving like a random walk on some infinite group or monoid. The salient result is that all 0-automatic queues are quasi-reversible. When considering the two simplest and extremal cases of 0-automatic queues, we recover the simple M/M/1 queue, and Gelenbe’s G-queue with positive and negative customers.
منابع مشابه
Zero-automatic queues and product form
We introduce and study a new model: 0-automatic queues. Roughly, 0-automatic queues are characterized by a special buffering mechanism evolving like a random walk on some infinite group or monoid. The salient result is that all stable 0-automatic queues have a product form stationary distribution and a Poisson output process. When considering the two simplest and extremal cases of 0-automatic q...
متن کاملAutomatic Verification of Multi-queue Discrete Timed Automata
We propose a new infinite-state model, called the Multi-queue Discrete Timed Automaton MQDTA, which extends Timed Automata with queues, but only has integer-valued clocks. Due to careful restrictions on queue usage, the binary reachability (the set of all pairs of configurations ( of an MQDTA such that can reach through zero or more transitions) is effectively semilinear. We then prove the deci...
متن کاملSOME GENERALIZATIONS OF WEAK CONVERGENCE RESULTS ON MULTIPLE CHANNEL QUEUES IN HEAVY TRAFFIC.
This paper extends certain results of Iglehart and Whitt on multiple channel queues to the case where the inter-arrival times and service times are not necessarily identically distributed. It is shown that the weak convergence results in this case are exactly the same as those obtained by Iglehart and Whitt
متن کاملLongest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملThe Fluid Limit of an Overloaded Processor Sharing Queue
This paper primarily concerns strictly supercritical fluid models, which arise as functional law of large numbers approximations for overloaded processor sharing queues. Analogous results for critical fluid models associated with heavily loaded processor sharing queues are contained in Gromoll et al. [9] and Puha and Williams [15]. An important distinction between critical and strictly supercri...
متن کامل